def counting_kangaroos_is_fun():
sizes = []
for kangaroos in range(int(input())):
sizes.append(int(input()))
sizes.sort(reverse=True)
half_length = len(sizes) // 2 + (len(sizes) // 2 * 2 < len(sizes))
first_half, second_half = sizes[:half_length], sizes[half_length:]
visible = len(sizes)
a = 0
b = 0
while a < len(first_half) and b < len(second_half):
if first_half[a] / 2 >= second_half[b]:
visible -= 1
a += 1
b += 1
elif b < len(second_half):
b += 1
else:
break
print(visible)
counting_kangaroos_is_fun()
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |
XOREQN Xor Equation | MAKEPAL Weird Palindrome Making |
HILLSEQ Hill Sequence | MAXBRIDGE Maximise the bridges |
WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |
1002. Find Common Characters | 1602A - Two Subsequences |
1555A - PizzaForces | 1607B - Odd Grasshopper |
1084A - The Fair Nut and Elevator | 1440B - Sum of Medians |
1032A - Kitchen Utensils | 1501B - Napoleon Cake |
1584B - Coloring Rectangles | 1562B - Scenes From a Memory |
1521A - Nastia and Nearly Good Numbers | 208. Implement Trie |
1605B - Reverse Sort | 1607C - Minimum Extraction |